Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Resolve the Classification Problem over Encrypted data Using K-Nearest Neighbour

Author : C Deepika 1 S Deepak 2 Jestina Thomas 3 Akansha Singh 4

Date of Publication :7th April 2016

Abstract: Data mining is widely used in numerous areas such as banking, medicine, scientific research and various other government applications. Data Classification is most extensively used task in data mining applications. The rise of various issues in privacy has led to several solutions to this problem. However, with the increased fame of cloud computing, users can now outsource their data onto the cloud in an encrypted form, as well as perform the required mining tasks on the cloud. Since the data is in an encrypted form on the cloud, existing privacy-preserving classification techniques are not suitable. In this paper, we focus on a viable technique to perform data classification using k-NN classifier over the encrypted data and secure the confidentiality of data, privacy of the user’s input query and also hide the data access patterns. We also analyze the efficiency of the proposed protocol empirically.

Reference :

    1. S. De Capitani di Vimercati, S. Foresti, and P. Samarati. Managing and accessing data in the cloud: Privacy risks and approaches. In 7th International Conference on Risk and Security of Internet and Systems (CRiSIS), pages 1–9, 2012.
    2. Goyal, Vipul, et al. "Attribute-based encryption for fine-grained access control of encrypted data." Proceedings of the 13th ACM conference on Computer and communications security. Acm, 2006
    3. Aggarwal, Charu C., and S. Yu Philip. A general survey of privacy-preserving data mining models and algorithms. Springer US, 2008.
    4. Peterson, Leif E. "K-nearest neighbor." Scholarpedia 4.2 (2009): 1883.
    5. Lindell, Yehuda, and Benny Pinkas. "Privacy preserving data mining." Advances in Cryptology— CRYPTO 2000. Springer Berlin Heidelberg, 2000
    6. Gentry, Craig. A fully homomorphic encryption scheme. Diss. Stanford University, 2009.
    7. Shamir, Adi. "How to share a secret." Communications of the ACM 22.11 (1979): 612- 613.
    8. A. Ben-David, N. Nisan, and B. Pinkas. Fairplaymp - a system for secure multi-party computation. In ACM CCS, October 2008.
    9. Bogdanov, Dan, Sven Laur, and Jan Willemson. "Sharemind: A framework for fast privacy-preserving computations." Computer Security-ESORICS 2008. Springer Berlin Heidelberg, 2008. 192-206.
    10. Agrawal, Rakesh, and Ramakrishnan Srikant. "Privacy-preserving data mining." ACM Sigmod Record. Vol. 29. No. 2. ACM, 2000.
    11. Nishide, Takashi, and Kouichi Sakurai. "Distributed paillier cryptosystem without trusted dealer." Information Security Applications. Springer Berlin Heidelberg, 2010. 44-60.

Recent Article